排序方式: 共有208条查询结果,搜索用时 171 毫秒
41.
一种新的基本概率函数构建方法及应用 总被引:1,自引:0,他引:1
针对Dempster-Shafer(D-S)证据推理中基本概率赋值函数的构造问题,基于模糊聚类分析给出了一种新的构建方法.将它应用到雷达目标识别的仿真实验中,并与灰关联法相比较,结果表明该方法切实可行,不仅提高了基本概率赋值的准确性和稳定性,而且利用了数据的结构信息,有效缓解了证据的冲突. 相似文献
42.
43.
44.
45.
针对水面舰艇编队在防空作战时如何适时、适量地选取火力分配方案。采用定性定量相结合的方法,重点剖析了灰色局势决策方法的具体求解步骤,并将之应用于水面舰艇编队对空防御时的火力分配方案优选。最后,通过实例验证了该方法的严谨性。以此确定的最优局势更具可信性,符合军事决策的特点。 相似文献
46.
介绍了战时装甲装备的各级修理机构,给出了战时装甲装备修理任务的划分标准,描述了修理对象的分布规律——艾拉姆咖(Эрланга)分布的分布函数和概率密度函数。在此基础上,计算得到了战损某型坦克进入各级修理机构的概率,通过对比分析,发现我军修理任务的划分存在不合理性,俄军修理任务的划分比较科学,建议采用俄军修理任务的划分标准。 相似文献
47.
48.
49.
In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
50.
用仿真模型研究了仓库物资的发放过程,定量解决了如何科学合理地分配一条作业线中作业机械的使用问题。根据这一结果,研究了在给定作业量的情况下如何确定作业机械数量的方法。 相似文献